New Lower Bounds For Orthogonal Drawings
نویسنده
چکیده
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for orthogonal graph drawings. We prove lower bounds on the number of bends and, when crossings are not allowed, also lower bounds on the size of the grid. Communicated by D. Wagner: submitted July 1997; revised November 1998. Some results of this paper were part of the author’s diploma thesis at TU Berlin under the supervision of Prof. R. Möhring, and have been presented in an extended abstract at Graph Drawing ’95, Passau, Germany. T. Biedl., New Lower Bounds , JGAA, 2(7) 1–31 (1998) 2
منابع مشابه
Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
This paper presents the first non-trivial lower bounds for the total number of bends in 3-D orthogonal graph drawings with vertices represented by points. In particular, we prove lower bounds for the number of bends in 3-D orthogonal drawings of complete simple graphs and multigraphs, which are tight in most cases. These result are used as the basis for the construction of infinite classes of c...
متن کاملA Better Heuristic for Orthogonal Graph Drawings
16 We end this paper by mentioning some open problems and directions for further research: Valiant proved that a grid-area of (n 2) is necessary for drawing non-planar graphs, since the crossing number can be (n 2) 26]. However, the involved constants are very small. For planar graphs (crossing number 0) a drawing with grid-area O(n log 2 n) is possible 14, 26], and the best known lower bound i...
متن کاملLower Bounds for Planar Orthogonal Drawings of Graphs
We study planar orthogonal drawings of graphs and provide lower bounds on the number of bends along the edges. We exhibit graphs on n vertices that require (n) bends in any layout, and show that there exist optimal drawings that require (n) bends and have all of them on a single edge of length (n 2). This work nds applications in VLSI layout, aesthetic graph drawing, and communication by light ...
متن کاملAlgorithms for Area-E cient Orthogonal Drawings
An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our algorithm needs area no greater than 0:76n 2 , and introduces no more ...
متن کاملAlgorithms and Bounds for Overloaded Orthogonal Drawings
Orthogonal drawings are widely used for graph visualization due to their high clarity and ease of representation. But when it comes to highdegree and massive graphs, even orthogonal drawings have difficulties producing a clean and simple visualization. In this paper we present a technique called Overloaded Orthogonal Drawing that greatly improves the readability by proposing a new vertex placem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 2 شماره
صفحات -
تاریخ انتشار 1998